Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
نویسندگان
چکیده
منابع مشابه
Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep
We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments in the plane, report all intersecting horizontal-vertical pairs. The problem has important applications in VLSI layout and graphics, which are large-scale in nature. The algorithms under evaluation...
متن کاملExperiments on the Practical I/o Eeciency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep Experiments on the Practical I/o Eeciency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep
We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments in the plane, report all intersecting horizontal-vertical pairs. The problem has important applications in VLSI layout and graphics, which are large-scale in nature. The algorithms under evaluation...
متن کاملSpace-Efficient Plane-Sweep Algorithms
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of n items and that the available workspace is Θ(s) bits, where lgn ≤ s ≤ n · lg n. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of n points that runs in O(n/s+n·lg s) time. We give a simple algorithm to enum...
متن کاملA Comparison of Plane Sweep Delaunay Triangulation Algorithms
This paper presents a survey as well as a new sweep-circle algorithm, on plane sweep algorithms for computing the Delaunay triangulation. The algorithms examined are: Fortune’s sweep-line algorithm, Zalik’s sweep-line algorithm, and a sweep-circle algorithm proposed by Adam, Kauffmann, Schmitt, and Spehner. We test implementations of these algorithms on a number of uniform and none-uniform dist...
متن کاملIPNWPSR: Iterated Partial Neighbour Word Plane Sweep Replicated, Evolution of Searching in Partial Tandem Replicated Sequence on Plane Sweep Algorithm
This paper describes a method to optimize the plane sweep algorithm. The goal of this paper is to develop a method that reduces the comparison through removing the tandem replicated word comparison and also using partial search technique in a document for escaping from the keywords that are ineffective. The approach introduces Plane Sweep algorithm that is the base algorithm used to search for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(97)00020-5